Planar Perfect Matching is in NC
نویسنده
چکیده
Consider a planar graph G = (V,E) with polynomially bounded edge weight function w : E → [0, poly(n)]. The main results of this paper are NC algorithms for the following problems: • minimum weight perfect matching in G, • maximum cardinality and maximum weight matching in G when G is bipartite, • maximum multiple-source multiple-sink flow in G where c : E → [1, poly(n)] is a polynomially bounded edge capacity function, • minimum weight f -factor in G where f : V → [1, poly(n)], • min-cost flow in G where c : E → [1, poly(n)] is a polynomially bounded edge capacity function and b : V → [1, poly(n)] is a polynomially bounded vertex demand function. There have been no known NC algorithms for any of these problems previously. In order to solve these problems we develop a new relatively simple but versatile framework that is combinatorial in spirit. It handles the combinatorial structure of matchings directly and needs to only know weights of appropriately defined matchings from algebraic subroutines.
منابع مشابه
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, finding a perfect matching when one exists can also be done in NC [8, 7]. However in general planar graphs (when the bipartite condition is removed), no NC algorithm for constructing a perfect matching is known. We ad...
متن کاملPlanar Graph Perfect Matching is in NC
Is perfect matching in NC? That is to say, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder t...
متن کاملSome perfect matchings and perfect half-integral matchings in NC
We show that for any class of bipartite graphs which is closed under edge deletion and where the number of perfect matchings can be counted in NC, there is a deterministic NC algorithm for finding a perfect matching. In particular, a perfect matching can be found in NC for planar bipartite graphs and K3,3-free bipartite graphs via this approach. A crucial ingredient is part of an interior-point...
متن کاملNC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs
In 1988, Vazirani gave an NC algorithm for computing the number of perfect matchings in K3,3-minor-free graphs by building on Kasteleyn’s scheme for planar graphs, and stated that this “opens up the possibility of obtaining an NC algorithm for finding a perfect matching in K3,3-free graphs.” In this paper, we finally settle this 30-year-old open problem. Building on the recent breakthrough resu...
متن کاملPerfect Matching in Bipartite Planar Graphs is in UL
We prove that Perfect Matching in bipartite planar graphs is in UL, improving upon the previous bound of SPL (see [DKR10]) on its space complexity. We also exhibit space complexity bounds for some related problems. Summarizing, we show that, constructing: 1. a Perfect Matching in bipartite planar graphs is in UL 2. a Hall Obstacle in bipartite planar graphs is in NL; 3. an Even Perfect Matching...
متن کاملMatchings in Graphs
We know that counting perfect matchings is polynomial time when we restrict ourselves to the class of planar graphs. Generally speaking, the decision and search versions of a problem turn out to be “easier” than the counting question. For example, the problem of determining if a perfect matching exists, and finding one when it does, is polynomial time in general graphs, while the question of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.07869 شماره
صفحات -
تاریخ انتشار 2017